Condition numbers for the tensor rank decomposition
نویسندگان
چکیده
منابع مشابه
Tensor rank-one decomposition of probability tables
We propose a new additive decomposition of probability tables tensor rank-one decomposition. The basic idea is to decompose a probability table into a series of tables, such that the table that is the sum of the series is equal to the original table. Each table in the series has the same domain as the original table but can be expressed as a product of one-dimensional tables. Entries in tables ...
متن کاملSparse and Low-Rank Tensor Decomposition
Motivated by the problem of robust factorization of a low-rank tensor, we study the question of sparse and low-rank tensor decomposition. We present an efficient computational algorithm that modifies Leurgans’ algoirthm for tensor factorization. Our method relies on a reduction of the problem to sparse and low-rank matrix decomposition via the notion of tensor contraction. We use well-understoo...
متن کاملFace Recognition by Discriminative Orthogonal Rank-one Tensor Decomposition
Discriminative subspace analysis has been a popular approach to face recognition. Most of the previous work such as Eigen-faces (Turk & Pentlend, 1991), LDA (Belhumeur et al., 1997), Laplacian faces (He et al., 2005a), as well as a variety of tensor based subspace analysis methods (He et al., 2005b; Chen et al., 2005; Xu et al., 2006; Hua et al., 2007), can all be unified in the graph embedding...
متن کاملGuaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updates
In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank-1 update which is the alternating version of the tensor power iteration adapted for asymmetric tensors. Local convergence guarantees are established for third order tensors of rank k in d dimensions, wh...
متن کاملExploiting tensor rank-one decomposition in probabilistic inference
We propose a new additive decomposition of probability tables – tensor rank-one decomposition. The basic idea is to decompose a probability table into a series of tables, such that the table that is the sum of the series is equal to the original table. Each table in the series has the same domain as the original table but can be expressed as a product of one-dimensional tables. Entries in table...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.08.014